Combinatorial Structures to Represent Simple Games
نویسنده
چکیده
We connect three different topics: combinatorial structures, simple games and influence games. We establish the bases to represent some simple games or some influence games by using combinatorial structures. These considerations are also able to generate any object of any topic based in graphs, for instance, molecules applied to chemistry, among others. Key–Words: Combinatorial Structures, Generating Simple Games, Generating Influence Games, Generating Molecules.
منابع مشابه
Combinatorial Structures to Modeling Simple Games and Applications
We connect three different topics: combinatorial structures, game theory and chemistry. In particular, we establish the bases to represent some simple games, defined as influence games, and molecules, defined from atoms, by using combinatorial structures. First, we characterize simple games as influence games using influence graphs. It let us to modeling simple games as combinatorial structures...
متن کاملCombinatorial structure and randomized subexponential algorithms for infinite games
The complexity of solving infinite games, including parity, mean payoff, and simple stochastic, is an important open problem in verification, automata, and complexity theory. In this paper, we develop an abstract setting for studying and solving such games, based on function optimization over certain discrete structures. We introduce new classes of recursively local-global (RLG) and partial rec...
متن کاملHybrid Key pre-distribution scheme for wireless sensor network based on combinatorial design
Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ens...
متن کاملOptimal Coalition Structures in Graph Games
We consider the problem of finding the optimal coalition structure in Weighted Graph Games (WGGs), a simple restricted representation of coalitional games [12]. The agents in such games are vertices of the graph, and the value of a coalition is the sum of the weights of the edges present between coalition members. The optimal coalition structure is a partition of the agents to coalitions, that ...
متن کاملParity Games and Automata for Game Logic (Extended Version)
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone μ-calculus, which in turn is expressively equivalent to monotone modal automata. Parity games and automata are important tools for dealing with the combinatorial complexit...
متن کامل